The Sum of Exponents of Maximal Repetitions in Standard Sturmian Words
نویسنده
چکیده
A maximal repetition is a non-extendable (with the same period) periodic segment in a string, in which the period repeats at least twice. In this paper we study problems related to the structure of maximal repetitions in standard Sturmian words and present the formulas for the sum of their exponents. Moreover, we show how to compute the sum of exponents of maximal repetitions in any standard Sturmian word in linear time with respect to the (total) size of its compressed representation. The presented formulas and algorithm can be easily modified to obtain the total run length of the word.
منابع مشابه
The Number of Runs in Sturmian Words
Denote by S the class of standard Sturmian words. It is a class of highly compressible words extensively studied in combinatorics of words, including the well known Fibonacci words. The suffix automata for these words have a very particular structure. This implies a simple characterization (described in the paper by the Structural Lemma) of the periods of runs (maximal repetitions) in Sturmian ...
متن کاملAbelian Repetitions in Sturmian Words
We investigate abelian repetitions in Sturmian words. We exploit a bijection between factors of Sturmian words and subintervals of the unitary segment that allows us to study the periods of abelian repetitions by using classical results of elementary Number Theory. If km denotes the maximal exponent of an abelian repetition of period m, we prove that lim sup km/m ≥ √ 5 for any Sturmian word, an...
متن کاملCharacterization of Repetitions in Sturmian Words: A New Proof
We present a new, dynamical way to study powers (or repetitions) in Sturmian words based on results from Diophantine approximation theory. As a result, we provide an alternative and shorter proof of a result by Damanik and Lenz characterizing powers in Sturmian words [Powers in Sturmian Sequences, European J. Combin. 24 (2003), 377–390]. Further, as a consequence, we obtain a previously known f...
متن کاملAbelian powers and repetitions in Sturmian words
Richomme, Saari and Zamboni (J. Lond. Math. Soc. 83: 79–95, 2011) proved that at every position of an infinite Sturmian word starts an abelian power of exponent k, for every positive integer k. Here, we improve on this result, studying the maximal exponent of abelian powers and abelian repetitions (an abelian repetition is the analogous of a fractional power in the abelian setting) occurring in...
متن کاملAsymptotic Behaviour of the Maximal Number of Squares in Standard Sturmian Words
Denote by sq(w) the number of distinct squares in a string w and let S be the class of standard Sturmian words. They are generalizations of Fibonacci words and are important in combinatorics on words. For Fibonacci words the asymptotic behaviour of the number of runs and the number of squares is the same. We show that for Sturmian words the situation is quite different. The tight bound 8 10 |w|...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013